CPBPV: a constraint-programming framework for bounded program verification
نویسندگان
چکیده
منابع مشابه
CPBVP: A Constraint-Programming Framework for Bounded Program Verification
This paper studies how to verify the conformity of a program with its specification and proposes a novel constraint-programming framework for bounded program verification (CPBPV). The CPBPV framework uses constraint stores to represent the specification and the program and explores execution paths nondeterministically. The input program is partially correct if each constraint store so produced ...
متن کاملA relational framework for bounded program verification
All software verification techniques, from theorem proving to testing, share the common goal of establishing a program’s correctness with both (1) a high degree of confidence and (2) a low cost to the user, two criteria in tension with one another. Theorem proving offers the benefit of high confidence, but requires significant expertise and effort from the user. Testing, on the other hand, can ...
متن کاملComparison between CPBPV, ESC/Java, CBMC, Blast, EUREKA and Why for Bounded Program Verification
– ESC/Java (http://kind.ucd.ie/products/opensource/ESCJava2/): Extended Static Checker for Java is a programming tool that attempts to find common run-time errors in JML-annotated Java programs by static analysis of the program code and its formal annotations. – CBMC (http://www.cprover.org/cbmc/): is a Bounded Model Checker for ANSI-C and C++ programs. It allows verifying array bounds (buffer ...
متن کاملA Dominance Framework for Constraint Programming
Constraint Programming [1] (CP) is a declarative programming paradigm for solving combinatorial satisfiability and optimization problems. It has numerous practical applications e.g., in the fields of scheduling, timetabling, configuration and computer graphics. The search in current CP systems earns its efficiency mainly from so-called destructive techniques, such as constraint propagation or s...
متن کاملA Proof Slicing Framework for Program Verification
In the context of program verification, we propose a formal framework for proof slicing that can aggressively reduce the size of proof obligations as a means of performance improvement. In particular, each large proof obligation may be broken down into smaller proofs, for which the overall processing cost can be greatly reduced, and be even more effective under proof caching. Our proposal is bu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2010
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-009-9089-9